Shift: A Zero FLOP, Zero Parameter Alternative to Spatial Convolutions
نویسندگان
چکیده
Neural networks rely on convolutions to aggregate spatial information. However, spatial convolutions are expensive in terms of model size and computation, both of which grow quadratically with respect to kernel size. In this paper, we present a parameter-free, FLOP-free “shift” operation as an alternative to spatial convolutions. We fuse shifts and point-wise convolutions to construct end-to-end trainable shift-based modules, with a hyperparameter characterizing the tradeoff between accuracy and efficiency. To demonstrate the operation’s efficacy, we replace ResNet’s 3x3 convolutions with shift-based modules for improved CIFAR10 and CIFAR100 accuracy using 60% fewer parameters; we additionally demonstrate the operation’s resilience to parameter reduction on ImageNet, outperforming ResNet family members. We finally show the shift operation’s applicability across domains, achieving strong performance with fewer parameters on classification, face verification and style transfer.
منابع مشابه
A New Class of Zero-Inflated Logarithmic Series Distribution
Through this paper we suggest an alternative form of the modified zero-inflated logarithmic series distribution of Kumar and Riyaz (Statistica, 2013) and study some of its important aspects. The method of maximum likelihood is employed for estimating the parameters of the distribution and certain test procedures are considered for testing the significance of the additional parameter of the model. ...
متن کاملEfficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place convolutions, the memory requirements are identical with the zero-padding technique, with the important distinction that the additional work memory need not be contiguous with the input data. This decoupling of data a...
متن کاملImplicitly Dealiased Convolutions: Example Applications and Performance Comparison
Implicitly dealiasing is a recently-developed technique which improves upon conventional zero padding to compute linear convolutions via fast Fourier transforms. For onedimensional inputs, the memory requirements and performance are similar to conventional zero-padded convolutions, but implicitly dealiased convolutions are faster and require less memory when the data is multi-dimensional. We sh...
متن کاملDealiased Convolutions for Pseudospectral Simulations
Efficient algorithms have recently been developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place convolutions, the memory requirements are identical with the zero-padding technique, with the important distinction that the additional work memory need not be contiguous with the input data. ...
متن کاملAn Fft-based Approach in Acceleration of Discrete Green’s Function Method for An- Tenna Analysis
In this paper, the fast Fourier transform (FFT) to perform spatial convolutions of the time domain discrete Green’s functions (DGF) method related to the analysis of the antenna with more than one dimension has been proposed. For this aim, the discrete Green’s functions and the currents on the antenna have been appropriately defined periodic so as to use the zero padded fast Fourier transform. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1711.08141 شماره
صفحات -
تاریخ انتشار 2017